Property Grammars and the Problem of Constraint Satisfaction
نویسندگان
چکیده
The notion of constraint appears in all modern linguistic theories. However, constraint satisfaction, which is the typical way of implementing constraints, is not really used for the implementation of such theories. We propose in this paper a formalism called Property Grammar which is totally based on constraints: all linguistic information is represented by means of properties which allow parsing to be conceived (and implemented) as a constraint satisfaction problem.
منابع مشابه
Constraint Solving and Language Processing
We propose Abductive Concept Formation Grammars, a CHRmethodology for treating long distance dependencies by abducing themissing elements while relating the constituents that must be related.We discuss our ideas both from a classical analysis point of view, andfrom a property-grammar based perspective. We exemplify them throughrelative clauses first, and next through the mor...
متن کاملDeductive Parsing in Interaction Grammars
We present a parsing algorithm for Interaction Grammars using the deductive parsing framework. This approach brings new perspectives to this problem, departing from previous methods which rely on constraint-solving techniques.
متن کاملDeductive Parsing with Interaction Grammars
We present a parsing algorithm for Interaction Grammars using the deductive parsing framework. This approach brings new perspectives to this problem, departing from previous methods which rely on constraint-solving techniques.
متن کاملCHR Grammars with multiple constraint stores
CHR Grammars (CHRG) are a recent constraint-based grammar formalism added on top of CHR analogously to the way Definite Clause Grammars are defined and implemented over Prolog. A CHRG executes as an error robust bottom-up parser, and the formalism provides several advantages for natural language analysis reported elsewhere [4–6]. A notable property is CHRG’s inherent ability to handle abduction...
متن کاملStructural Constraint Satisfaction Draft | Comments and Suggestions Welcome
Conventional constraint satisfaction problem (CSP) formulations are static. There is a given set of constraints and variables, and the structure of the constraint graph does not change. For a lot of search problems, though, it is not clear in advance what a solution's constraint graph will look like. To overcome these deeciencies, we introduce the concept of structural constraints, which are re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000